0.11/0.17 % Problem : Vampire---4.8_25359 : TPTP v0.0.0. Released v0.0.0. 0.11/0.19 % Command : run_E %s %d THM 0.20/0.40 % Computer : n011.cluster.edu 0.20/0.40 % Model : x86_64 x86_64 0.20/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.20/0.40 % Memory : 8042.1875MB 0.20/0.40 % OS : Linux 3.10.0-693.el7.x86_64 0.20/0.40 % CPULimit : 1440 0.20/0.40 % WCLimit : 180 0.20/0.40 % DateTime : Mon Jul 3 13:10:39 EDT 2023 0.20/0.40 % CPUTime : 0.26/0.60 Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.DscNK3GZFy/Vampire---4.8_25359 0.45/0.60 # Version: 3.1pre001-ho 0.45/0.87 # Preprocessing class: HSLMSMSMLMLCHSA. 0.45/0.87 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.45/0.87 # Starting new_ho_10 with 900s (5) cores 0.45/0.87 # Starting ho_unfolding_6 with 180s (1) cores 0.45/0.87 # Starting sh4l with 180s (1) cores 0.45/0.87 # Starting ehoh_best_nonlift_nonlambdatoforall with 180s (1) cores 0.45/0.87 # new_ho_10 with pid 25721 completed with status 0 0.45/0.87 # Result found by new_ho_10 0.45/0.87 # Preprocessing class: HSLMSMSMLMLCHSA. 0.45/0.87 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.45/0.87 # Starting new_ho_10 with 900s (5) cores 0.45/0.87 # No SInE strategy applied 0.45/0.87 # Search class: HGHSM-FSLM32-MHSMSSBN 0.45/0.87 # Scheduled 5 strats onto 5 cores with 900 seconds (900 total) 0.45/0.87 # Starting new_ho_10 with 541s (1) cores 0.45/0.87 # Starting ho_unfolding_6 with 91s (1) cores 0.45/0.87 # Starting sh4l with 91s (1) cores 0.45/0.87 # Starting ehoh_best_nonlift_nonlambdatoforall with 91s (1) cores 0.45/0.87 # Starting full_lambda_8 with 86s (1) cores 0.45/0.87 # ho_unfolding_6 with pid 25729 completed with status 0 0.45/0.87 # Result found by ho_unfolding_6 0.45/0.87 # Preprocessing class: HSLMSMSMLMLCHSA. 0.45/0.87 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.45/0.87 # Starting new_ho_10 with 900s (5) cores 0.45/0.87 # No SInE strategy applied 0.45/0.87 # Search class: HGHSM-FSLM32-MHSMSSBN 0.45/0.87 # Scheduled 5 strats onto 5 cores with 900 seconds (900 total) 0.45/0.87 # Starting new_ho_10 with 541s (1) cores 0.45/0.87 # Starting ho_unfolding_6 with 91s (1) cores 0.45/0.87 # Preprocessing time : 0.020 s 0.45/0.87 0.45/0.87 # Proof found! 0.45/0.87 # SZS status Theorem 0.45/0.87 # SZS output start CNFRefutation 0.45/0.87 thf(decl_22, type, is_of: $i > ($i > $o) > $o). 0.45/0.87 thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o). 0.45/0.87 thf(decl_25, type, in: $i > $i > $o). 0.45/0.87 thf(decl_77, type, e_is: $i > $i > $i > $o). 0.45/0.87 thf(decl_123, type, nat: $i). 0.45/0.87 thf(decl_124, type, n_is: $i > $i > $o). 0.45/0.87 thf(decl_162, type, n_ts: $i > $i > $i). 0.45/0.87 thf(decl_189, type, frac: $i). 0.45/0.87 thf(decl_190, type, n_fr: $i > $i > $i). 0.45/0.87 thf(decl_191, type, num: $i > $i). 0.45/0.87 thf(decl_192, type, den: $i > $i). 0.45/0.87 thf(decl_193, type, n_eq: $i > $i > $o). 0.45/0.87 thf(decl_231, type, esk29_0: $i). 0.45/0.87 thf(decl_232, type, esk30_0: $i). 0.45/0.87 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.DscNK3GZFy/Vampire---4.8_25359', def_e_is)). 0.45/0.87 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.DscNK3GZFy/Vampire---4.8_25359', def_all_of)). 0.45/0.87 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.DscNK3GZFy/Vampire---4.8_25359', def_is_of)). 0.45/0.87 thf(def_n_eq, axiom, ((n_eq)=(^[X1:$i, X218:$i]:((n_is @ (n_ts @ (num @ X1) @ (den @ X218)) @ (n_ts @ (num @ X218) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.DscNK3GZFy/Vampire---4.8_25359', def_n_eq)). 0.45/0.87 thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.DscNK3GZFy/Vampire---4.8_25359', def_n_is)). 0.45/0.87 thf(satz40a, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X219:$i]:((in @ X219 @ nat))) @ (^[X220:$i]:((n_eq @ (n_fr @ (n_ts @ (num @ X1) @ X220) @ (n_ts @ (den @ X1) @ X220)) @ X1))))))), file('/export/starexec/sandbox2/tmp/tmp.DscNK3GZFy/Vampire---4.8_25359', satz40a)). 0.45/0.88 thf(satz40, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X303:$i]:((in @ X303 @ nat))) @ (^[X304:$i]:((n_eq @ X1 @ (n_fr @ (n_ts @ (num @ X1) @ X304) @ (n_ts @ (den @ X1) @ X304))))))))), file('/export/starexec/sandbox2/tmp/tmp.DscNK3GZFy/Vampire---4.8_25359', satz40)). 0.45/0.88 thf(c_0_7, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 0.45/0.88 thf(c_0_8, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.45/0.88 thf(c_0_9, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.45/0.88 thf(c_0_10, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_ts @ (num @ Z1) @ (den @ Z0))))))), inference(fof_simplification,[status(thm)],[def_n_eq])). 0.45/0.88 thf(c_0_11, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_7])). 0.45/0.88 thf(c_0_12, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_8, c_0_9])). 0.45/0.88 thf(c_0_13, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_ts @ (num @ Z1) @ (den @ Z0))))))), inference(apply_def,[status(thm)],[c_0_10, c_0_11])). 0.45/0.88 thf(c_0_14, negated_conjecture, ~(![X731:$i]:(((in @ X731 @ frac)=>![X730:$i]:(((in @ X730 @ nat)=>((n_ts @ (num @ (n_fr @ (n_ts @ (num @ X731) @ X730) @ (n_ts @ (den @ X731) @ X730))) @ (den @ X731))=(n_ts @ (num @ X731) @ (den @ (n_fr @ (n_ts @ (num @ X731) @ X730) @ (n_ts @ (den @ X731) @ X730)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz40a])]), c_0_12]), c_0_13])). 0.45/0.88 thf(c_0_15, plain, ![X922:$i]:(((in @ X922 @ frac)=>![X921:$i]:(((in @ X921 @ nat)=>((n_ts @ (num @ X922) @ (den @ (n_fr @ (n_ts @ (num @ X922) @ X921) @ (n_ts @ (den @ X922) @ X921))))=(n_ts @ (num @ (n_fr @ (n_ts @ (num @ X922) @ X921) @ (n_ts @ (den @ X922) @ X921))) @ (den @ X922))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz40]), c_0_12]), c_0_13])). 0.45/0.88 thf(c_0_16, negated_conjecture, ((in @ esk29_0 @ frac)&((in @ esk30_0 @ nat)&((n_ts @ (num @ (n_fr @ (n_ts @ (num @ esk29_0) @ esk30_0) @ (n_ts @ (den @ esk29_0) @ esk30_0))) @ (den @ esk29_0))!=(n_ts @ (num @ esk29_0) @ (den @ (n_fr @ (n_ts @ (num @ esk29_0) @ esk30_0) @ (n_ts @ (den @ esk29_0) @ esk30_0))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])). 0.45/0.88 thf(c_0_17, plain, ![X1985:$i, X1986:$i]:((~(in @ X1985 @ frac)|(~(in @ X1986 @ nat)|((n_ts @ (num @ X1985) @ (den @ (n_fr @ (n_ts @ (num @ X1985) @ X1986) @ (n_ts @ (den @ X1985) @ X1986))))=(n_ts @ (num @ (n_fr @ (n_ts @ (num @ X1985) @ X1986) @ (n_ts @ (den @ X1985) @ X1986))) @ (den @ X1985)))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])). 0.45/0.88 thf(c_0_18, negated_conjecture, ((n_ts @ (num @ (n_fr @ (n_ts @ (num @ esk29_0) @ esk30_0) @ (n_ts @ (den @ esk29_0) @ esk30_0))) @ (den @ esk29_0))!=(n_ts @ (num @ esk29_0) @ (den @ (n_fr @ (n_ts @ (num @ esk29_0) @ esk30_0) @ (n_ts @ (den @ esk29_0) @ esk30_0))))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.45/0.88 thf(c_0_19, plain, ![X1:$i, X4:$i]:((((n_ts @ (num @ X1) @ (den @ (n_fr @ (n_ts @ (num @ X1) @ X4) @ (n_ts @ (den @ X1) @ X4))))=(n_ts @ (num @ (n_fr @ (n_ts @ (num @ X1) @ X4) @ (n_ts @ (den @ X1) @ X4))) @ (den @ X1)))|~((in @ X1 @ frac))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_17])). 0.45/0.88 thf(c_0_20, negated_conjecture, (in @ esk30_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_16])). 0.45/0.88 thf(c_0_21, negated_conjecture, (in @ esk29_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_16])). 0.45/0.88 thf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_21])]), ['proof']). 0.45/0.88 # SZS output end CNFRefutation 0.45/0.88 # Parsed axioms : 534 0.45/0.88 # Removed by relevancy pruning/SinE : 0 0.45/0.88 # Initial clauses : 859 0.45/0.88 # Removed in clause preprocessing : 234 0.45/0.88 # Initial clauses in saturation : 625 0.45/0.88 # Processed clauses : 412 0.45/0.88 # ...of these trivial : 4 0.45/0.88 # ...subsumed : 21 0.45/0.88 # ...remaining for further processing : 387 0.45/0.88 # Other redundant clauses eliminated : 202 0.45/0.88 # Clauses deleted for lack of memory : 0 0.45/0.88 # Backward-subsumed : 0 0.45/0.88 # Backward-rewritten : 0 0.45/0.88 # Generated clauses : 4580 0.45/0.88 # ...of the previous two non-redundant : 4390 0.45/0.88 # ...aggressively subsumed : 0 0.45/0.88 # Contextual simplify-reflections : 3 0.45/0.88 # Paramodulations : 4137 0.45/0.88 # Factorizations : 18 0.45/0.88 # NegExts : 0 0.45/0.88 # Equation resolutions : 204 0.45/0.88 # Total rewrite steps : 254 0.45/0.88 # Propositional unsat checks : 0 0.45/0.88 # Propositional check models : 0 0.45/0.88 # Propositional check unsatisfiable : 0 0.45/0.88 # Propositional clauses : 0 0.45/0.88 # Propositional clauses after purity: 0 0.45/0.88 # Propositional unsat core size : 0 0.45/0.88 # Propositional preprocessing time : 0.000 0.45/0.88 # Propositional encoding time : 0.000 0.45/0.88 # Propositional solver time : 0.000 0.45/0.88 # Success case prop preproc time : 0.000 0.45/0.88 # Success case prop encoding time : 0.000 0.45/0.88 # Success case prop solver time : 0.000 0.45/0.88 # Current number of processed clauses : 323 0.45/0.88 # Positive orientable unit clauses : 90 0.45/0.88 # Positive unorientable unit clauses: 9 0.45/0.88 # Negative unit clauses : 3 0.45/0.88 # Non-unit-clauses : 221 0.45/0.88 # Current number of unprocessed clauses: 4588 0.45/0.88 # ...number of literals in the above : 18154 0.45/0.88 # Current number of archived formulas : 0 0.45/0.88 # Current number of archived clauses : 0 0.45/0.88 # Clause-clause subsumption calls (NU) : 32874 0.45/0.88 # Rec. Clause-clause subsumption calls : 6674 0.45/0.88 # Non-unit clause-clause subsumptions : 25 0.45/0.88 # Unit Clause-clause subsumption calls : 2237 0.45/0.88 # Rewrite failures with RHS unbound : 0 0.45/0.88 # BW rewrite match attempts : 23 0.45/0.88 # BW rewrite match successes : 6 0.45/0.88 # Condensation attempts : 412 0.45/0.88 # Condensation successes : 1 0.45/0.88 # Termbank termtop insertions : 311228 0.45/0.88 0.45/0.88 # ------------------------------------------------- 0.45/0.88 # User time : 0.214 s 0.45/0.88 # System time : 0.035 s 0.45/0.88 # Total time : 0.249 s 0.45/0.88 # Maximum resident set size: 11148 pages 0.45/0.88 0.45/0.88 # ------------------------------------------------- 0.45/0.88 # User time : 0.750 s 0.45/0.88 # System time : 0.068 s 0.45/0.88 # Total time : 0.818 s 0.45/0.88 # Maximum resident set size: 2620 pages 0.45/0.88 % E---3.1 exiting 0.45/0.88 EOF